Propositional Proof Complexity An Introduction

نویسنده

  • Samuel R. Buss
چکیده

1 Preface and Acknowledgements This article is an abridged and revised version of a 1996 McGill University technical report [14]. The technical report was based on lectures delivered by the author at a workshop in Holetown, Barbados and on the authors prepared overhead transparencies. The audience at this workshop wrote scribe notes which then formed the technical report [14]. The material selected for the present article corresponds roughly to the content of the author's lectures at the NATO summer school held in Marktoberdorf, Germany in July-August 1997. The present document consists essentially of the first, second, and sixth parts of [14]. Part I (sections 2-6) of the present document on Propositional Proof and Complexity is based on the scribe notes by K. Regan and J. Torán; Part II (sections 7-14) on Interpolation Theorems for Propositional Logic is based on the scribe notes by E. Allender and A. Maciel; and Part III (sections 15-16) on Cutting Plane Proof Systems, is partly based on the scribe notes of C. Lautemann and C. Zamora-Cura. The last section of part III has been rewritten to take into account subsequent progress in interpolation theorems and lower bounds for cutting plane proof systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Propositional Proof System with Permutation Quantifiers

Propositional proof complexity is a field of theoretical computer science which concerns itself with the lengths of formal proofs in various propositional proof systems. Frege systems are an important class of propositional proof systems. Extended Frege augments them by allowing the introduction of new variables to abbreviate formulas. Perhaps the largest open question in propositional proof co...

متن کامل

P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...

متن کامل

$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n ǫ ), (for a constant ǫ = 1/3). One corollary is that certain propositional formulations of the statement P 6= NP do not hav...

متن کامل

Propositional Proof Complexity and Cellular Automata 22

Two fields connected with computers, automated theorem proving on one side and computational complexity theory on the other side, gave the birth to the field of propositional proof complexity in the late ’60s and ’70s. In this chapter we consider how classic propositional logic and in particular Propositional Proof Complexity can be combined with the study of Cellular Automata. It is organized ...

متن کامل

Proof Complexity of Non-classical Logics

Proof complexity is an interdisciplinary area of research utilising techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures. Traditionally, propositional proofs have been the main object of investigation in proof complexity. Due their richer expressivity and numerous applications within computer science, also non-cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997